Minimum number of partial triangulations
نویسندگان
چکیده
We show that the number of partial triangulations any set n points on plane in general position is at least (n?2)nd Catalan number. This tight for convex n-gons. also describe all equality cases.
منابع مشابه
Computing Triangulations with Minimum Stabbing Number
For a given point set P or a polygon P , we consider the problem of finding a triangulation T with minimum stabbing number, i.e., a triangulation such that the maximal number of segments hit by any ray going through T is minimized. We prove that this problem is NP-hard; this differs from the problem of triangulating a polygon with minimum edge weight, which is solvable in polynomial time with a...
متن کاملAn Improved Lower Bound on the Minimum Number of Triangulations
Upper and lower bounds for the number of geometric graphs of specific types on a given set of points in the plane have been intensively studied in recent years. For most classes of geometric graphs it is now known that point sets in convex position minimize their number. However, it is still unclear which point sets minimize the number of geometric triangulations; the so-called double circles a...
متن کاملOn Compatible Triangulations with a Minimum Number of Steiner Points
Two vertex-labelled polygons are compatible if they have the same clockwise cyclic ordering of vertices. The definition extends to polygonal regions (polygons with holes) and to triangulations—for every face, the clockwise cyclic order of vertices on the boundary must be the same. It is known that every pair of compatible n-vertex polygonal regions can be extended to compatible triangulations b...
متن کاملMinimum Weight Pseudo-Triangulations
We consider the problem of computing a minimum weight pseudo-triangulation of a set S of n points in the plane. We first present an O(n log n)-time algorithm that produces a pseudo-triangulation of weight O(wt(M(S)) · log n) which is shown to be asymptotically worstcase optimal, i.e., there exists a point set S for which every pseudotriangulation has weight Ω(log n · wt(M(S))), where wt(M(S)) i...
متن کاملPlanar Minimum-Weight Triangulations
The classic problem of nding a minimum-weight triangulation for a given planar straight-line graph is considered in this paper. A brief overview of known methods is given in addition to some new results. A parallel greedy triangulation algorithm is presented along with experimental data that suggest a logarithmic relationship between the number of input vertices and its running time in the aver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2023
ISSN: ['1095-9971', '0195-6698']
DOI: https://doi.org/10.1016/j.ejc.2022.103636